0.00/0.03	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.04	% Command    : java -Xss128m -Xmx4g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar %s -t %d -p --atp cvc4=/export/starexec/sandbox2/solver/bin/externals/cvc4 --atp e=/export/starexec/sandbox2/solver/bin/externals/eprover --atp iprover=/export/starexec/sandbox2/solver/bin/externals/iprover
0.03/0.23	% Computer   : n129.star.cs.uiowa.edu
0.03/0.23	% Model      : x86_64 x86_64
0.03/0.23	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.03/0.23	% Memory     : 32218.625MB
0.03/0.23	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.03/0.23	% CPULimit   : 300
0.03/0.23	% DateTime   : Sun Jul 15 13:16:09 CDT 2018
0.03/0.24	% CPUTime    : 
1.85/1.22	% [INFO] 	 Running in sequential loop mode. 
2.40/1.45	% [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(59),restrictUniAttempts(true),termOrdering(CPO)> 
2.82/1.53	% [INFO] 	 iprover registered as external prover. 
2.82/1.54	% [INFO] 	 e registered as external prover. 
2.82/1.54	% [INFO] 	 cvc4 registered as external prover. 
2.82/1.54	% [INFO] 	 Parsing finished. Scanning for conjecture ... 
2.82/1.59	% [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
3.12/1.63	% [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
3.12/1.63	% [INFO] 	 Type checking passed. Searching for refutation ... 
15.08/4.89	% [INFO] 	 Killing All external provers ... 
15.08/4.90	% Time passed: 4569ms
15.08/4.90	% Effective reasoning time: 3676ms
15.08/4.90	% Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(59),restrictUniAttempts(true),termOrdering(CPO)>
15.08/4.90	% Axioms used in derivation (0): 
15.08/4.90	% No. of inferences in proof: 20
15.08/4.90	% No. of processed clauses: 12
15.08/4.90	% No. of generated clauses: 255
15.08/4.90	% No. of forward subsumed clauses: 2
15.08/4.90	% No. of backward subsumed clauses: 0
15.08/4.90	% No. of ground rewrite rules in store: 5
15.08/4.90	% No. of non-ground rewrite rules in store: 0
15.08/4.90	% No. of positive (non-rewrite) units in store: 0
15.08/4.90	% No. of negative (non-rewrite) units in store: 2
15.08/4.90	% No. of choice functions detected: 0
15.08/4.91	% No. of choice instantiations: 0
15.08/4.92	% SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4569 ms resp. 3676 ms w/o parsing
15.18/4.97	% SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
15.18/4.97	thf(leibeq_type, type, leibeq: ($o > ($o > $o))).
15.18/4.97	thf(leibeq_def, definition, (leibeq = (^ [A:$o,B:$o]: ! [C:($o > $o)]: ((C @ A) => (C @ B))))).
15.18/4.97	thf(h_type, type, h: ($o > $o)).
15.18/4.97	thf(sk1_type, type, sk1: ($o > $o)).
15.18/4.97	thf(sk20_type, type, sk20: ($o > $o)).
15.18/4.97	thf(1,conjecture,((leibeq @ (h @ (leibeq @ (h @ $true) @ (h @ $false))) @ (h @ $false))),file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj)).
15.18/4.97	thf(2,negated_conjecture,((~ (leibeq @ (h @ (leibeq @ (h @ $true) @ (h @ $false))) @ (h @ $false)))),inference(neg_conjecture,[status(cth)],[1])).
15.18/4.97	thf(3,plain,((~ (! [A:($o > $o)]: ((A @ (h @ (! [B:($o > $o)]: ((B @ (h @ $true)) => (B @ (h @ $false)))))) => (A @ (h @ $false)))))),inference(defexp_and_simp_and_etaexpand,[status(thm)],[2])).
15.18/4.97	thf(5,plain,((sk1 @ (h @ (! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false))))))),inference(cnf,[status(esa)],[3])).
15.18/4.97	thf(4,plain,((~ (sk1 @ (h @ $false)))),inference(cnf,[status(esa)],[3])).
15.18/4.97	thf(6,plain,(((sk1 @ (h @ (! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false)))))) != (sk1 @ (h @ $false)))),inference(paramod_ordered,[status(thm)],[5,4])).
15.18/4.97	thf(7,plain,(((h @ (! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false))))) != (h @ $false))),inference(simp,[status(thm)],[6])).
15.18/4.97	thf(8,plain,((! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false))))),inference(simp,[status(thm)],[7])).
15.18/4.97	thf(11,plain,(! [A:($o > $o)] : ((~ (A @ (h @ $true))) | (A @ (h @ $false)))),inference(cnf,[status(esa)],[8])).
15.18/4.97	thf(267,plain,(! [A:($o > $o)] : ((~ (A @ (h @ $true))) | ((A @ (h @ $false)) != (sk1 @ (h @ $false))))),inference(paramod_ordered,[status(thm)],[11,4])).
15.18/4.97	thf(389,plain,((~ (sk1 @ (h @ $true)))),inference(pre_uni,[status(thm)],[267:[bind(A, $thf(sk1))]])).
15.18/4.97	thf(478,plain,(((sk1 @ (h @ (! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false)))))) != (sk1 @ (h @ $true)))),inference(paramod_ordered,[status(thm)],[5,389])).
15.18/4.97	thf(493,plain,(((h @ (! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false))))) != (h @ $true))),inference(simp,[status(thm)],[478])).
15.18/4.97	thf(633,plain,((~ (! [A:($o > $o)]: ((A @ (h @ $true)) => (A @ (h @ $false)))))),inference(simp,[status(thm)],[493])).
15.18/4.97	thf(698,plain,((sk20 @ (h @ $true))),inference(cnf,[status(esa)],[633])).
15.18/4.97	thf(751,plain,(! [A:($o > $o)] : ((A @ (h @ $false)) | ((sk20 @ (h @ $true)) != (A @ (h @ $true))))),inference(paramod_ordered,[status(thm)],[698,11])).
15.18/4.97	thf(758,plain,((sk20 @ (h @ $false))),inference(pre_uni,[status(thm)],[751:[bind(A, $thf(sk20))]])).
15.18/4.97	thf(697,plain,((~ (sk20 @ (h @ $false)))),inference(cnf,[status(esa)],[633])).
15.18/4.97	thf(776,plain,($false),inference(rewrite,[status(thm)],[758,697])).
15.18/4.97	thf(777,plain,($false),inference(simp,[status(thm)],[776])).
15.18/4.97	% SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
15.18/4.97	% [INFO] 	 Killing All external provers ... 
15.31/5.06	EOF
